#include <vector>
#include <iostream>
#include <algorithm>
#include <fstream>

using namespace std;
using square = vector<vector<char>>;

void clockwise90(square m){
    //方法1：m[i][j] -- m[j][N - i - 1]
    //方法2：求m的转置矩阵， 对m垂直翻转
}

int main(int argc, char const *argv[])
{
    square src, dst;

    ifstream ifs("Transform.in");

    int n = 0;
    ifs >> n;
    for(int i = 0; i < n; ++i){
        string str;
        vector<char> v;
        ifs >> str;
        for(char j : str){
            v.push_back(j);
        }
        src.push_back(v);
    }
    for(int i = 0; i < n; ++i){
        string str;
        vector<char> v;
        ifs >> str;
        for(char j : str){
            v.push_back(j);
        }
        dst.push_back(v);
    }

    ofstream ofs("Transform.out");
    return 0;
}
